*(x, *(minus(y), y)) → *(minus(*(y, y)), x)
↳ QTRS
↳ DependencyPairsProof
*(x, *(minus(y), y)) → *(minus(*(y, y)), x)
*1(x, *(minus(y), y)) → *1(y, y)
*1(x, *(minus(y), y)) → *1(minus(*(y, y)), x)
*(x, *(minus(y), y)) → *(minus(*(y, y)), x)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
*1(x, *(minus(y), y)) → *1(y, y)
*1(x, *(minus(y), y)) → *1(minus(*(y, y)), x)
*(x, *(minus(y), y)) → *(minus(*(y, y)), x)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
*1(x, *(minus(y), y)) → *1(y, y)
Used ordering: Polynomial interpretation [25,35]:
*1(x, *(minus(y), y)) → *1(minus(*(y, y)), x)
The value of delta used in the strict ordering is 17.
POL(*1(x1, x2)) = (4)x_1 + (4)x_2
POL(minus(x1)) = 1/4 + x_1
POL(*(x1, x2)) = 4 + x_1 + x_2
*(x, *(minus(y), y)) → *(minus(*(y, y)), x)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
*1(x, *(minus(y), y)) → *1(minus(*(y, y)), x)
*(x, *(minus(y), y)) → *(minus(*(y, y)), x)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
*1(x, *(minus(y), y)) → *1(minus(*(y, y)), x)
The value of delta used in the strict ordering is 1.
POL(*1(x1, x2)) = (4)x_1 + (4)x_2
POL(minus(x1)) = 0
POL(*(x1, x2)) = 1/4
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
*(x, *(minus(y), y)) → *(minus(*(y, y)), x)